Inconsistency Measurement based on Variables in Minimal Unsatisfiable Subsets
نویسندگان
چکیده
Measuring inconsistency degrees of knowledge bases (KBs) provides important context information for facilitating inconsistency handling. Several semantic and syntax based measures have been proposed separately. In this paper, we propose a new way to define inconsistency measurements by combining semantic and syntax based approaches. It is based on counting the variables of minimal unsatisfiable subsets (MUSes) and minimal correction subsets (MCSes), which leads to two equivalent inconsistency degrees, named IDMUS and IDMCS. We give the theoretical and experimental comparisons between them and two purely semantic-based inconsistency degrees: 4-valued and the Quasi Classical semantics based inconsistency degrees. Moreover, the computational complexities related to our new inconsistency measurements are studied. As it turns out that computing the exact inconsistency degrees is intractable in general, we then propose and evaluate an anytime algorithm to make IDMUS and IDMCS usable in knowledge management applications. In particular, as most of syntax based measures tend to be difficult to compute in reality due to the exponential number of MUSes, our new inconsistency measures are practical because the numbers of variables in MUSes are often limited or easily to be approximated. We evaluate our approach on the DC benchmark. Our encouraging experimental results show that these new inconsistency measurements or their approximations are efficient to handle large knowledge bases and to better distinguish inconsistent knowledge bases.
منابع مشابه
Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
a r t i c l e i n f o a b s t r a c t Keywords: Inconsistency measures Minimal inconsistent subsets Minimal unsatisfiable subformulae SAT Random SAT There is extensive theoretical work on measures of inconsistency for arbitrary formulae in knowledge bases. Many of these are defined in terms of the set of minimal inconsistent subsets (MISes) of the base. However, few have been implemented or exp...
متن کاملDiscovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization
An unsatisfiable set of constraints is minimal if all its (strict) subsets are satisfiable. The task of type error diagnosis requires finding all minimal unsatisfiable subsets of a given set of constraints (representing an error), in order to generate the best explanation of the error. Similarly circuit error diagnosis requires finding all minimal unsatisfiable subsets in order to make minimal ...
متن کاملUsing Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets
An unsatisfiable set is a set of formulas whose conjunction is unsatisfiable. Every unsatisfiable set can be corrected, i.e., made satisfiable, by removing a subset of its members. The subset whose removal yields satisfiability is called a correction subset. Given an unsatisfiable set F there is a well known hitting set duality between the unsatisfiable subsets of F and the correction subsets o...
متن کاملStrong Inconsistency in Nonmonotonic Reasoning
Minimal inconsistent subsets of knowledge bases play an important role in classical logics, most notably for repair and inconsistency measurement. It turns out that for nonmonotonic reasoning a stronger notion is needed. In this paper we develop such a notion, called strong inconsistency. We show that—in an arbitrary logic, monotonic or not—minimal strongly inconsistent subsets play the same ro...
متن کاملInconsistency measurement thanks to mus decomposition
Bearing contradictory knowledge is often unavoidable among multi-agents. Measuring inconsistency degrees of knowledge bases of different agents facilitates the understanding of an agent to her environment. Several semantics or syntax-based approaches have been proposed to quantify inconsistencies. In this paper, we propose a new inconsistency measuring framework based on both minimal unsatisfia...
متن کامل